The partition problem for finite abelian groups
نویسندگان
چکیده
منابع مشابه
On a Permutation Problem for Finite Abelian Groups
LetG be a finite additive abelian group with exponent n > 1, and let a1, . . . , an−1 be elements of G. We show that there is a permutation σ ∈ Sn−1 such that all the elements saσ(s) (s = 1, . . . , n− 1) are nonzero if and only if ∣∣∣{1 6 s < n : n d as 6= 0 }∣∣∣ > d− 1 for every positive divisor d of n. When G is the cyclic group Z/nZ, this confirms a conjecture of Z.-W. Sun.
متن کاملDecomposing finite Abelian groups
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann Hypothesis) also leads to an efficient algorithm for computing class numbers (known to be at least as difficult as factoring).
متن کاملFactoring finite abelian groups
It is shown that if in the factorization of a finite cyclic group each factor has either prime power order or order equal to the product of two primes then one factor must be periodic. This is shown to be the best possible result of this type. 2004 Elsevier Inc. All rights reserved.
متن کاملnon-divisibility for abelian groups
Throughout all groups are abelian. We say a group G is n-divisible if nG = G. If G has no non-zero n-divisible subgroups for all n>1 then we say that G is absolutely non-divisible. In the study of class C consisting all absolutely non-divisible groups such as G, we come across the sub groups T_p(G) = the sum of all p-divisible subgroups and rad_p(G) = the intersection of all p^nG. The proper...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1980
ISSN: 0097-3165
DOI: 10.1016/0097-3165(80)90069-2